The Permutation Algorithm for Non-Sparse Matrix Determinant in Symbolic Computation
نویسنده
چکیده
This paper considers the symbolic determinant computation. The aptness of permutation method for symbolic determinant is justified and a new efficient algorithm is proposed to implement the permutation method. Exploiting the fact computers perform arithmetic operations fast, the proposed algorithm generate all the permutations without manipulation on additional 2nd array or redundancies found in the existing permutation generating algorithms. The proposed algorithm is very efficient for computing symbolic determinant of a non-sparse matrix whose order is below 13.
منابع مشابه
Symbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملGeneralized matrix functions, determinant and permanent
In this paper, using permutation matrices or symmetric matrices, necessary and sufficient conditions are given for a generalized matrix function to be the determinant or the permanent. We prove that a generalized matrix function is the determinant or the permanent if and only if it preserves the product of symmetric permutation matrices. Also we show that a generalized matrix function is the de...
متن کاملVoice-based Age and Gender Recognition using Training Generative Sparse Model
Abstract: Gender recognition and age detection are important problems in telephone speech processing to investigate the identity of an individual using voice characteristics. In this paper a new gender and age recognition system is introduced based on generative incoherent models learned using sparse non-negative matrix factorization and atom correction post-processing method. Similar to genera...
متن کاملHierarchical Symbolic Analysis of Large Analog Circuits with Determinant Decision Diagrams
A novel hierarchical approach is proposed to symbolic analysis of large analog circuits. The key idea is to use a graph-based representation—called Determinant Decision Diagram (DDD)— to represent the symbolic determinant and cofactors associated with the MNA matrix for each subcircuit block. By exploiting the inherent sharing and sparsity of symbolic expressions, DDD is capable of representing...
متن کاملNumerical Algorithms for Symbolic Analysis of Large Circuits
This paper presents an algorithm for fast large-change sensitivity computation for approximate symbolic analysis. The sensitivity is used for identifying negligible elements of circuit model that can be removed in order to simplify symbolic solution. The method is based on combination of the Sherman-Morison formula and sparse matrix techniques. Effectiveness of the method was tested on several ...
متن کامل